Focused Grounding for Markov Logic Networks
نویسندگان
چکیده
Markov logic networks have been successfully applied to many problems in AI. However, the computational complexity of the inference procedures has limited their application. Previous work in lifted inference, lazy inference and cutting plane inference has identified cases where the entire ground network need not be constructed. These approaches are specific to particular inference procedures, and apply well only to certain classes of problems. We introduce a method of focused grounding that can use either general purpose or domain specific heuristics to produce only the most relevant ground formulas. Though a solution to the focused grounding is not, in general, a solution to the complete grounding, we show empirically that the smaller search space of a focused grounding makes it easier to locate a good solution. We evaluate focused grounding on two diverse domains, joint entity resolution and abductive plan recognition. We show improved results and decreased computation cost for the entity resolution domain relative to a complete grounding. Focused grounding in abductive plan recognition produces state of the art results in a domain where complete grounding
منابع مشابه
Fully Parallel Inference in Markov Logic Networks
Abstract: Markov logic is a powerful tool for handling the uncertainty that arises in real-world structured data; it has been applied successfully to a number of data management problems. In practice, the resulting ground Markov logic networks can get very large, which poses challenges to scalable inference. In this paper, we present the first fully parallelized approach to inference in Markov ...
متن کاملMarkov Logic Improves Protein β-Partners Prediction
Protein β-partners prediction is an important problem in protein structure that can be naturally formulated as supervised link prediction. We show that prediction performance can be improved using a hybrid solution based on Markov logic networks with grounding-specific weights.
متن کاملScaling-up Importance Sampling for Markov Logic Networks
Markov Logic Networks (MLNs) are weighted first-order logic templates for generating large (ground) Markov networks. Lifted inference algorithms for them bring the power of logical inference to probabilistic inference. These algorithms operate as much as possible at the compact first-order level, grounding or propositionalizing the MLN only as necessary. As a result, lifted inference algorithms...
متن کاملPrediction of protein β-residue contacts by Markov logic networks with grounding-specific weights
Motivation: Accurate prediction of contacts between β-strand residues can significantly contribute towards ab initio prediction of the 3D structure of many proteins. Contacts in the same protein are highly interdependent. Therefore, significant improvements can be expected by applying statistical relational learners that overcome the usual machine learning assumption that examples are independe...
متن کاملTowards Incremental Grounding in Tuffy
Markov Logic Networks (MLN) have become a powerful framework in logical and statistical modeling. However, most of the current MLN implementations are in-memory, and cannot scale up to large data sets. Only recently, Tuffy addresses the scalability issue by using a pure RDB-based implementation. Inference in Tuffy could be divided into two stages: grounding and search. The grounding stage subst...
متن کامل